#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

ll qmi(ll a, ll b)
{
    ll res = 1;
    while(b)
    {
        if(b & 1)res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;
}
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		x ^= x << 13;
		x ^= x >> 7;
		x ^= x << 17;
		return x; 
	}
	size_t operator () (uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); // 时间戳
		return splitmix64(x + FIXED_RANDOM);
	}
};

void solve()
{
    string s;
    cin >> s;
    int n = s.size();
    string ans;
    for(int i = 0; i < n; i++) {
        int t = s[i] - '0';
        int f = i;
        for(int j = i + 1; j < i + 9 && j < n; j++){
            if(s[j] - '0' - (j - i) > t){
                f = j;
                t = s[j] - '0' - (j - i);
            }
        }
        for(int j = f; j > i; j--) {
            swap(s[j], s[j - 1]);
            s[j - 1] -= 1;
        }
    }
    cout << s << endl;
}


int main()
{
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}